Location:
Search - graph cut
Search list
Description: 微软的SQL SERVER数据库的Image、text等字段都属于二进制的大对象。这些对象的存取和其他轻型对象略有不同。
微软.NET Framework的System.IO命名空间下给我们提供了一个FileStream文件流类。我们可以使用这个文件流对二进制大对象轻松进行读写。
我实现了一个简单的WinForm程序，这个程序通过点击“Open”按钮选择一个bmp或者jpg文件，并显示在图形控件PictureBox中。通过“Save”按钮存入数据库。点击“View”CheckBox可以切换到浏览状态，观看存入数据库的图片。
由于对二进制大对象使用的流操作，所以对于任何文件都具有通用性。读写文本文件也可以这么做。
-Microsoft s field and so on SQL SERVER database Image, text all
belongs to binary the big object. These objects deposits and
withdrawals and other light objects have the difference slightly.
MicrosoftNET Framework System.Under the IO naming space provided a FileStream document to us to flow
the kind. We may use this document to flow to the binary big object
with ease carry on read-write. I have realized a simple WinForm
procedure, this procedure through clicks on "Open" the button to
choose bmp or the jpg document, and the demonstration controls in
PictureBox in the graph. The button stores the database through
"Save". Clicks on "View" CheckBox to be possible to cut to the
browsing condition, watches stores the database the picture. Because
to binary big object use class operation, therefore all has the
versatility regarding any document. The read-write text documents also
may such do.
Platform: |
Size: 33792 |
Author: 张庆 |
Hits:
Description: 关于图形恢复算法的一篇文章，好文章呀，呵呵，自己砍去-Recovery Algorithm on the graph in an article, good article, Yes, Oh, cut off their own
Platform: |
Size: 309248 |
Author: 亚子 |
Hits:
Description: Implementation of Edmonds Karp algorithm that calculates maxFlow of graph.
Input:
For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The nodes are numbered from 1 to n. The node 1 and node n should be in different sets. There are no more than 30 arcs and 15 nodes. The arc weights vary between 1 and 1 000 000.
Output:
The output is a single line for each case, with the corresponding minimum size cut.
Example:
Input:
7 11
1 2 3
1 4 3
2 3 4
3 1 3
3 4 1
3 5 2
4 6 6
4 5 2
5 2 1
5 7 1
6 7 9
Output:
5-Implementation of Edmonds Karp algorithm that calculates maxFlow of graph.
Input:
For each test case, the first line contains the number of vertices (n) and the number of arcs (m). Then, there exist m lines, one for each arc (source vertex, ending vertex and arc weight, separated by a space). The nodes are numbered from 1 to n. The node 1 and node n should be in different sets. There are no more than 30 arcs and 15 nodes. The arc weights vary between 1 and 1 000 000.
Output:
The output is a single line for each case, with the corresponding minimum size cut.
Example:
Input:
7 11
1 2 3
1 4 3
2 3 4
3 1 3
3 4 1
3 5 2
4 6 6
4 5 2
5 2 1
5 7 1
6 7 9
Output:
5
Platform: |
Size: 1024 |
Author: Joao |
Hits:
Description: 压缩包中包括几个常用算法对应的POJ练习题的实现，包括，无向图的欧拉回路，点的割集，TRIE树，最优比率生成树，最小树形图-Compressed package includes several commonly used algorithms POJ corresponds to the realization of exercises, including, undirected graph of the Euler circuit, point cut sets, TRIE tree, the optimal ratio spanning tree, the smallest tree
Platform: |
Size: 5120 |
Author: ACMaryland |
Hits:
Description: C++类运用。几何体。
计算圆与圆外接矩形，矩形外接圆。圆外切三角形四个图形的面积。周长。对角线-C++ classes to use. Geometry. Calculated circle and the circle bounding rectangle, rectangle circle. Cut four triangles outside circle graph area. Circumference. Diagonal
Platform: |
Size: 1024 |
Author: 郭静男 |
Hits:
Description: a b剪枝算法，输入为搜索图的及节点的权值，输出为被剪掉的节点-ab pruning algorithm, input search graph and the node weights, the output node as being cut off
Platform: |
Size: 4096 |
Author: lss |
Hits:
Description: 图论的相关MATLAB CODE 非常好用-grBase- find all bases of digraph
grCoBase- find all contrabases of digraph
grCoCycleBasis- find all independent cut-sets for a connected graph
grColEdge- solve the color problem for graph edges
grColVer- solve the color problem for graph vertexes
grComp- find all components of graph
grCycleBasis- find all independent cycles for a connected graph ...
Platform: |
Size: 31744 |
Author: 周界 |
Hits:
Description: 图论的标准应用解决边割集问题，模板输出最优边割集，图用邻接矩阵表示-The standard application of graph theory to solve the problem edge cut set, the optimal edge-cut set of template output, with adjacency matrix graph
Platform: |
Size: 1024 |
Author: ccl |
Hits:
Description: 图的基本应用，用于解决图的最有顶点割集，封装为模板，图用邻接矩阵表示-That the basic applications, used to solve most graph vertex cut set, package as a template, graph with adjacency matrix
Platform: |
Size: 1024 |
Author: ccl |
Hits:
Description: 介绍了图割的基本思想，包括最大流最小割算法，以及简单的图割实例-Introduced the basic idea of graph cuts, including the maximum flow minimum cut algorithm, and simple instances of graph cuts
Platform: |
Size: 1033216 |
Author: 黄鹏 |
Hits:
Description: 利用剪切板切图（Alt+PrtScn），在QQ找茬游戏中画出不同部分-Cut graph using the clipboard (Alt+ PrtScn), finding fault in the QQ plot in different parts of the game
Platform: |
Size: 29696 |
Author: ARTHAS |
Hits:
Description: 在管理科学、计算机科学、分子物理学、生物学、超大规模集成电路设计、代码设计、图像处理和电子工程等领域中，存在着大量的组合优化问题。例如，货郎担问题、最大截问题、0—1背包问题、图着色问题、设备布局问题以及布线问题等，这些问题至今仍未找到多项式时间算法。-In management science, computer science, molecular physics, biology, VLSI design, code design, image processing and electronic engineering and other fields, there are a large number of combinatorial optimization problems. For example, the traveling salesman problem, the maximum cut problem ,0-1 knapsack problem, graph coloring problems, equipment problems and wiring layout problems, these problems have yet to find a polynomial time algorithm.
Platform: |
Size: 185344 |
Author: 张浩 |
Hits:
Description: 分支界限法是由“分支”和“界限”策略两个部分组成，其中“分支”策略是对问题空间按照广度优先的策略进行搜索；“限界”策略是为了加速搜索速度而采用启发信息剪枝的策略。
使用分支限界法来解决单源最短路径问题时主要利用结点控制关系剪枝，在一般情况下，如果解空间树中以结点Y为根的子树中所含的解优于以结点X为根的子树中所含的解，则结点Y控制了结点X，以被控制的结点X为根的子树可以剪去。算法实现时，使用邻接矩阵表示图，二维数组存储图的邻接矩阵，使用数组记录源到各顶点的距离和路径上的前驱顶点。
-Branch and bound by the "branch" and "boundaries" strategy of two parts, one "branch" strategy is the problem of space in accordance with the breadth-first search strategy "bound" strategy is to accelerate the search speed and the use of heuristic pruning strategy.
Using the branch and bound method to solve the single-source shortest path problem between the main control by pruning nodes, in general, if the solution space to the tree root node Y is contained in the solution sub-tree nodes than to X is the root of the solution contained in the subtree, then Y control the end point node X, to be controlled node X is the root of the sub-tree can be cut. Algorithm, the use of adjacency matrix graph, two-dimensional array stored in the adjacency matrix, using an array of records from the source to the vertex distance and path of the precursor peak.
Platform: |
Size: 1024 |
Author: ss |
Hits:
Description: 经典图论，其中叙述了图论的经典算法等，如最大流、最小割等相关算法。-Classical graph theory, graph theory, which describes the classical algorithms, such as maximum flow, minimum cut, and other related algorithms.
Platform: |
Size: 508928 |
Author: 珞珞 |
Hits:
Description: 自己搜集，图割的论文，代码以及重要的文献，适合新手学习-Own collection, graph paper cut, code, and important documents, suitable for beginners to learn
Platform: |
Size: 8092672 |
Author: zhao |
Hits:
Description: 最大流最小割
可以测试某一个特定的图
也可以随机生成n个顶点的图和k条边
用来分析时间复杂度-Maximum flow minimum cut to test a particular map can also be randomly generated graph of n vertices and k edges used to analyze the time complexity
Platform: |
Size: 964608 |
Author: su |
Hits:
Description: 这个程序实现与Matlab的优化工具箱下，用于给图进行边着色。包含了很多图论的程序，如计算最大割集、连通度、最小覆盖边数等等……
-This program is implemented with Matlab Optimization Toolbox for graph edge coloring. Contains a lot of graph theory program, such as the calculation of the maximum cut sets, connectivity, minimal covering the number of edges, etc. ...
Platform: |
Size: 28672 |
Author: Kansess |
Hits:
Description: 计算阶跃折射率光纤传播常数、归一化频率、截止波长、导模数量等- Calculate for Step Index Fibers (using MATLAB):
a) Propagation constant (β)
b) Normalized propagation constant (b)
c) V number (V)
d) Check whether the fiber is single mode or multi mode.
e) Graph between normalized propagation constant (b) and V number
f) Cut off wavelength (λc)
g) Number of modes traveling in fiber (Ms)
Platform: |
Size: 1024 |
Author: fang mao |
Hits:
Description: 实现最小割，基于图的图像分割算法，学习必备。-Minimum cut graph-based image segmentation algorithm, learning essential.
Platform: |
Size: 15360 |
Author: Sonny |
Hits:
Description: Computer global min-cut in a graph. Implements random contraction algorithm. Need to be run multiple time for better solutions.
Platform: |
Size: 2048 |
Author: michael |
Hits:
«
1
2
...
8
9
10
11
12
1314
»